Tverberg-Type Theorems for Separoids

نویسندگان

  • Juan José Montellano-Ballesteros
  • Attila Pór
  • Ricardo Strausz
چکیده

Let S be a d-dimensional separoid of (k− 1)(d+1)+1 convex sets in some ‘large-dimensional’ Euclidean space IE . We prove a theorem that can be interpreted as follows: if the separoid S can be mapped with a monomorphism to a d-dimensional separoid of points P in general position, then there exists a k-colouring ς:S → Kk such that, for each pair of colours i, j ∈ Kk, the convex hulls of their preimages do intersect —they are not separated. Here, by a monomorphism we mean an injective function such that the preimage of separated sets are separated. In a sense, this result is ‘dual’ to the Hadwiger-type

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realisation of separoids and a Tverberg-type problem

A separoid is a symmetric relation † ⊂ ( 2 2 ) defined on pairs of disjoint subsets which is closed as a filter in the natural partial order (i.e., A † B C † D ⇐⇒ A ⊆ C and B ⊆ D). We discus the Geometric Representation Theorem for separoids: every separoid (S, †) can be represented by a family of (convex) polytopes, and their Radon partitions, in the Euclidean space of dimension |S| − 1. Furth...

متن کامل

Projective Center Point and Tverberg Theorems

We present projective versions of the center point theorem and Tverberg’s theorem, interpolating between the original and the so-called “dual” center point and Tverberg theorems. Furthermore we give a common generalization of these and many other known (transversal, constraint, dual, and colorful) Tverberg type results in a single theorem, as well as some essentially new results about partition...

متن کامل

Erdös-Szekeres "happy end"-type theorems for separoïds

In 1935 Pál Erdős and György Szekeres proved that, roughly speaking, any configuration of n points in general position in the plane have log n points in convex position —which are the vertices of a convex polygon. Later, in 1983, Bernhard Korte and László Lovász generalised this result in a purely combinatorial context; the context of greedoids. In this note we give one step further to generali...

متن کامل

Chessboard complexes indomitable

We give a simpler, degree-theoretic proof of the striking new Tverberg type theorem of Blagojević, Ziegler and Matschke, arXiv:0910.4987v2. Our method also yields some new examples of “constrained Tverberg theorems” including a simple colored Radon’s theorem for d + 3 points in Rd. This gives us an opportunity to review some of the highlights of this beautiful theory and reexamine the role of c...

متن کامل

Two geometric representation theorems for separoids

Separoids capture the combinatorial structure which arises from the separations by hyperplanes of a family of convex sets in some Euclidian space. Furthermore, as we prove in this note, every abstract separoid S can be represented by a family of convex sets in the (|S| − 1)dimensional Euclidian space. The geometric dimension of the separoid is the minimum dimension where it can be represented a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2006